A Successive State Splitting Algorithm Based on the Mdl Criterion by Data-driven and Decision Tree Clustering

نویسندگان

  • Takatoshi Jitsuhiro
  • Tomoko Matsui
  • Satoshi Nakamura
چکیده

We propose a new Successive State Splitting (SSS) algorithm based on the Minimum Description Length (MDL) criterion to design tied-state HMM topologies automatically. The SSS algorithm is a mechanism for creating both temporal and contextual variations based on the Maximum Likelihood (ML) criterion. However, it also needs to empirically predetermine control parameters for use as stop criteria, for example, the total number of states. We introduce the MDL criterion to the ML-SSS algorithm so that it can automatically create proper topologies without such parameters. Experimental results show that our extended algorithm can automatically stop splitting and obtain more appropriate HMM topologies than the original one. We also extend the MDL-SSS algorithm by using phonetic decision tree clustering for contextual splitting. A method using a combination of phonetic decision tree clustering and data-driven clustering can automatically obtain almost the same performance as the original method.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automatic generation of non-uniform context-dependent HMM topologies based on the MDL criterion

We propose a new method of automatically creating nonuniform context-dependent HMM topologies by using the Minimum Description Length (MDL) criterion. Phonetic decision tree clustering is widely used, based on the Maximum Likelihood (ML) criterion, and creates only contextual variations. However, it also needs to empirically predetermine control parameters for use as stop criteria, for example,...

متن کامل

Cross-Validation and Minimum Generation Error based Decision Tree Pruning for HMM-based Speech Synthesis

This paper presents a decision tree pruning method for the model clustering of HMM-based parametric speech synthesis by cross-validation (CV) under the minimum generation error (MGE) criterion. Decision-tree-based model clustering is an important component in the training process of an HMM based speech synthesis system. Conventionally, the maximum likelihood (ML) criterion is employed to choose...

متن کامل

Acoustic modeling based on the MDL principle for speech recognition

Recently context-dependent phone units, such as triphones, have been used to model subword units in speech recognition based on Hidden Markov Models (HMMs). While most such methods employ clustering of the HMM parameters(e.g., subword clustering, state clustering, etc.), to control HMM size so as to avoid poor recognition accuracy due to an insu ciency of training data, none of them provide any...

متن کامل

Optimisation of acoustic models for a target accent using decision-tree state clustering

In this paper we extend the decision-tree state clustering algorithm normally used to construct tied-state hidden Markov models to allow for the explicit optimisation on a particular target accent. Although the traditional algorithm guarantees overall likelihood improvements when clustering states from multiple accents, per-accent improvements are not guaranteed. We develop a tractable formulat...

متن کامل

Decision-tree backing-off in HMM-based speech synthesis

This paper proposes a decision-tree backing-off technique for an HMM-based speech synthesis system. In the system, a decision-tree based context clustering technique is used for constructing parameter tying structures. In the context clustering, the MDL criterion has been used as a stopping criterion. In this paper, however, huge decision-trees are constructed without any stopping criterion. In...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003